Preferences over Sets
نویسندگان
چکیده
Typically, work on preference elicitation and reasoning about preferences has focused on the problem of specifying, modeling, and optimizing with preference over outcomes corresponding to single objects of interest. In a number of applications, however, the “outcomes” of interest are really sets of such atomic outcomes. For instance, when trying to form coalitions or committees, we need to select an optimal combination of individuals. In this paper we describe some initial work on specifying preferences over sets of objects, and selecting an optimal subset from a given set of objects. In particular, we show how TCP-nets can be used to handle this problem, and how an existing algorithm for preference-based constrained optimization can be adapted to the problem of optimal subset selection.
منابع مشابه
A social recommender system based on matrix factorization considering dynamics of user preferences
With the expansion of social networks, the use of recommender systems in these networks has attracted considerable attention. Recommender systems have become an important tool for alleviating the information that overload problem of users by providing personalized recommendations to a user who might like based on past preferences or observed behavior about one or various items. In these systems...
متن کاملArrovian Impossibilities in Aggregating Preferences over Sets
Given a society confronting a set of alternatives A, we consider the aggregation of individual preferences over the power set A of A into a social preference over A. In case we allow individuals to have any complete and transitive preference over A, Arrow’s impossibility theorem naturally applies. However, the Arrovian impossibility prevails, even when the set of admissible preferences over A i...
متن کاملModelling and learning user preferences over sets
Although there has been significant research on modeling and learning user preferences for various types of objects, there has been relatively little work on the problem of representing and learning preferences over sets of objects. We introduce a representation language, DD-PREF, that balances preferences for particular objects with preferences about the properties of the set. Specifically, we...
متن کاملEncoding monotonic multi-set preferences using CI-nets: preliminary report
CP-nets and their variants constitute one of the main AI approaches for specifying and reasoning about preferences. CI-nets, in particular, are a CP-inspired formalism for representing ordinal preferences over sets of goods, which are typically required to be monotonic. Considering also that goods often come in multi-sets rather than sets, a natural question is whether CI-nets can be used more ...
متن کاملParental Preferences over Children's Sex:The Case Study of Iran
The question of whether parents have preferences over their children’s sexes has long been of interest to economists and demographers. In this study, we first investigate the presence of these preferences among Iranian parents. Then, having established its existence, we next turn to characterize the quality of sex preference. There are two widely used methods for addressing this issue in the l...
متن کاملA Note on the Undercut Procedure ( Extended Abstract ) Haris Aziz
The undercut procedure was presented by Brams, Kilgour and Klamler (2012) as a procedure for identifying an envyfree allocation when agents have preferences over sets of objects. They assumed that agents have strict preferences over objects and their preferences are extended over to sets of objects via the responsive set extension. We point out some shortcomings of the undercut procedure. We th...
متن کامل